370A - Rook Bishop and King - CodeForces Solution

graphs math shortest paths *1100

Please click on ads to support us..

Python Code: 

r1, c1, r2, c2 = [int(x) for x in input().split()]

king = max(abs(r2-r1), abs(c2-c1))

rook = 0
if (r2 == r1 or c2 == c1):
    rook = 1
else:
    rook = 2

bishop = 0
if ((r1+c1)%2 != (r2+c2)%2):
    bisohp = 0
elif (r1+c1) == (r2+c2):
    bishop = 1
elif (r2-r1) == -(c2-c1):
    bishop = 1
elif (r2-r1) == (c2-c1):
    bishop = 1
else:
    bishop = 2

print(rook, bishop, king)


Comments

Submit
0 Comments
More Questions

448. Find All Numbers Disappeared in an Array
1155. Number of Dice Rolls With Target Sum
415. Add Strings
22. Generate Parentheses
13. Roman to Integer
2. Add Two Numbers
515. Find Largest Value in Each Tree Row
345. Reverse Vowels of a String
628. Maximum Product of Three Numbers
1526A - Mean Inequality
1526B - I Hate 1111
1881. Maximum Value after Insertion
237. Delete Node in a Linked List
27. Remove Element
39. Combination Sum
378. Kth Smallest Element in a Sorted Matrix
162. Find Peak Element
1529A - Eshag Loves Big Arrays
19. Remove Nth Node From End of List
925. Long Pressed Name
1051. Height Checker
695. Max Area of Island
402. Remove K Digits
97. Interleaving String
543. Diameter of Binary Tree
124. Binary Tree Maximum Path Sum
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
501A - Contest
160A- Twins
752. Open the Lock